Deep fictitious play for stochastic differential games

نویسندگان

چکیده

In this paper, we apply the idea of fictitious play to design deep neural networks (DNNs), and develop learning theory algorithms for computing Nash equilibrium asymmetric $N$-player non-zero-sum stochastic differential games, which refer as \emph{deep play}, a multi-stage process. Specifically at each stage, propose strategy letting individual player optimize her own payoff subject other players' previous actions, equivalent solve $N$ decoupled control optimization problems, are approximated by DNNs. Therefore, leads structure consisting DNNs, only communicate end stage. The resulted algorithm based on is scalable, parallel model-free, {\it i.e.}, using GPU parallelization, it can be applied any game with different symmetries heterogeneities ({\it e.g.}, existence major players). We illustrate performance comparing closed-form solution linear quadratic game. Moreover, prove convergence under appropriate assumptions, verify that convergent limit forms an open-loop equilibrium. also discuss extensions strategies designed upon closed-loop in end.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fictitious play in stochastic games

In this paper we examine an extension of the fictitious play process for bimatrix games to stochastic games. We show that the fictitious play process does not necessarily converge, not even in the 2 × 2 × 2 case with a unique equilibrium in stationary strategies. Here 2 × 2 × 2 stands for 2 players, 2 states, 2 actions for each player in each state.

متن کامل

Fictitious play in coordination games

We study the Fictitious Play process with bounded and unbounded recall in pure coordination games for which failing to coordinate yields a payoff of zero for both players. It is shown that every Fictitious Play player with bounded recall may fail to coordinate against his own type. On the other hand, players with unbounded recall are shown to coordinate (almost surely) against their own type as...

متن کامل

Solving parity games through fictitious play

The thesis aims to find an efficient algorithm for solving parity games. Parity games are graph-based, 0-sum, 2-person games with infinite plays. It is known that these games are determined: all nodes in these games are won by exactly one player. Solving parity games is equivalent to the model checking problem of modal mu-calculus; an efficient solution has important implications to program ver...

متن کامل

Fictitious Self-Play in Extensive-Form Games

Fictitious play is a popular game-theoretic model of learning in games. However, it has received little attention in practical applications to large problems. This paper introduces two variants of fictitious play that are implemented in behavioural strategies of an extensive-form game. The first variant is a full-width process that is realization equivalent to its normal-form counterpart and th...

متن کامل

Fictitious play in 2×n games

It is known that every continuous time fictitious play process approaches equilibrium in every nondegenerate 2×2 and 2×3 game, and it has been conjectured that convergence to equilibrium holds generally for 2×n games. We give a simple geometric proof of this. As a corollary, we obtain the same result for the discrete fictitious play process. Journal of Economic Literature classification numbers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Sciences

سال: 2021

ISSN: ['1539-6746', '1945-0796']

DOI: https://doi.org/10.4310/cms.2021.v19.n2.a2